Cartesian product

英 [kɑːˈtiːziən ˈprɒdʌkt]

美 [kɑːrˈtiːziən ˈprɑːdʌkt]

网络  笛卡兒積; 笛卡尔积; 笛卡儿积; 笛卡儿乘积; 笛卡尔乘积

计算机

双语例句

• The1= 1 one logic is in the expression to ensure the join will always be true and allows for the Cartesian Product result set.
  表达式中的1=1逻辑确保连接一直为true并允许笛卡尔Product结果集。
• The Adjacent-vertex Distinguishing Total-coloring Problem of Cartesian Product and Double Graph of Some Special Classes Graphs
  一些特殊图类的笛卡尔积和倍图的邻点可区别的全染色问题
• If the number of tuples, calculated by using the Cartesian product, exceeds the set threshold; the NON EMPTY clause is applied to the query.
  如果通过使用Cartesian产品计算的元组数超过设定的阈值，将NONEMPTY子句应用于查询。
• In this paper, A theorem for the binding number of multiple cartesian product of path and circuits is proven, and some limit properties of the binding number of multiple product graphs are presented.
  本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。
• On the Super 3-restricted Edge Connectivity of Cartesian Product of Graphs
  笛卡尔乘积图的超级3-限制边连通性
• The Geodetic Number of Cartesian Product on Cycles and Complete Graphs
  关于圈与完全图的笛卡儿积的测地数
• The Vertex Linear Arboricity of Complete Multiple Graphs and Cartesian Product Graphs
  完全多部图和笛卡儿积图的线性点荫度
• This method uses the hemispherical harmonics basis to represent incoming radiance and uses the Cartesian product of two hemispheres to define the BRDFs.
  该方法利用半球谐基函数对入射光线正交化，利用两个半球上的笛卡儿积来定义物体表面的双向反射率分布函数。
• The main results of the paper are as follows: we not only prove that the Cartesian product of graphs of path and path, path and cycle satisfies the conjecture, but also give their coloring number.
  本文的主要结果如下：我们不仅证明了路与路、路与圈的笛卡尔积图满足关联色数猜想，进而确定了它们的关联色数。
• Adjacent vertex-distinguishing VE-total coloring of Cartesian product graph of some graphs
  部分图笛卡儿积图的邻点可区别VE-全染色